Applying and Comparing Hidden Markov Model and Fuzzy Clustering Algorithms to Web Usage Data for Recommender Systems
نویسندگان
چکیده
As the information on the Web grows, the need of recommender systems to ease user navigations becomes evident. There exist many approaches of learning for Web usage based recommender systems. In this study, we apply and compare some of the methods of usage pattern discovery, like simple k-means clustering algorithm, fuzzy relational subtractive clustering algorithm, fuzzy mean field annealing clustering and hidden Markov model, for recommender systems. We use metrics like prediction strength, hit ratio, precision, prediction ability and F-Score to compare the applied methods on the usage data of the CTI Web site of DePaul University. Fuzzy mean field annealing clustering and hidden Markov model acted better than other methods due to fuzzy nation of human behavior in navigation and extra information utilized in sequence analysis.
منابع مشابه
Use of Semantic Similarity and Web Usage Mining to Alleviate the Drawbacks of User-Based Collaborative Filtering Recommender Systems
One of the most famous methods for recommendation is user-based Collaborative Filtering (CF). This system compares active user’s items rating with historical rating records of other users to find similar users and recommending items which seems interesting to these similar users and have not been rated by the active user. As a way of computing recommendations, the ultimate goal of the user-ba...
متن کاملIncreasing the Accuracy of Recommender Systems Using the Combination of K-Means and Differential Evolution Algorithms
Recommender systems are the systems that try to make recommendations to each user based on performance, personal tastes, user behaviors, and the context that match their personal preferences and help them in the decision-making process. One of the most important subjects regarding these systems is to increase the system accuracy which means how much the recommendations are close to the user int...
متن کاملCluster-Based Image Segmentation Using Fuzzy Markov Random Field
Image segmentation is an important task in image processing and computer vision which attract many researchers attention. There are a couple of information sets pixels in an image: statistical and structural information which refer to the feature value of pixel data and local correlation of pixel data, respectively. Markov random field (MRF) is a tool for modeling statistical and structural inf...
متن کاملAn Effective Algorithm in a Recommender System Based on a Combination of Imperialist Competitive and Firey Algorithms
With the rapid expansion of the information on the Internet, recommender systems play an important role in terms of trade and research. Recommender systems try to guess the user's way of thinking, using the in-formation of user's behavior or similar users and their views, to discover and then propose a product which is the most appropriate and closest product of user's interest. In the past dec...
متن کاملCapturing Browsing Interests of Users into Web Usage Profiles
We present a new weighted session similarity measure to capture the browsing interests of users in web usage profiles discovered from web log data. We base our similarity measure on the reasonable assumption that when users spend longer times on pages or revisit pages in the same session, then very likely, such pages are of greater interest to the user. The proposed similarity measure combines ...
متن کامل